Sharp characterizations of squarefree morphisms

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sharp Characterizations of Squarefree Morphisms

Squarefree morphisms, i.e. morphisms that preserve squarefreeness of words, have been a subject of interest since the works of Thue [8]. They are a powerful tool to prove properties on squarefree words and are used in particular to prove the existence of infinite sequences without repetition. The study of squarefree words is connected with cluestions in algebra and game theory, and recentiy sev...

متن کامل

CHARACTERIZATIONS OF FINITE GROUPS WITH p-FUSION OF SQUAREFREE TYPE

For G a finite group and p a prime this paper proves two theorems under hypotheses that restrict the index of the subgroup generated by every p-element x in certain subgroups generated by pairs of its conjugates. Under one set of hypotheses G is shown to be supersolvable. Simple groups satisfying a complementary fusion-theoretic hypothesis are classified.

متن کامل

Squarefree Values of Polynomials

where m is any integer > n:We will be interested in estimating the number of polynomials f(x) for which there exists an integer m such that f(m) is squarefree. This property should hold for all polynomials f(x) for which Nf is squarefree. However, this seems to be very di cult to establish. Nagel [8] showed that if f(x) 2 Z[x] is an irreducible quadratic and Nf is squarefree, then f(m) is squar...

متن کامل

On morphisms of crossed polymodules

‎In this paper‎, ‎we prove that the category of crossed polymodules (i.e‎. ‎crossed modules of polygroups) and their morphisms is finitely complete‎. ‎We‎, ‎therefore‎, ‎generalize the group theoretical case of this completeness property of crossed modules‎.

متن کامل

Squarefree Values of Multivariable Polynomials

Given f ∈ Z[x1, . . . , xn], we compute the density of x ∈ Z such that f(x) is squarefree, assuming the abc conjecture. Given f, g ∈ Z[x1, . . . , xn], we compute unconditionally the density of x ∈ Z such that gcd(f(x), g(x)) = 1. Function field analogues of both results are proved unconditionally. Finally, assuming the abc conjecture, given f ∈ Z[x], we estimate the size of the image of f({1, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1982

ISSN: 0304-3975

DOI: 10.1016/0304-3975(82)90023-8